On converse duality in complex nonlinear programming
نویسندگان
چکیده
منابع مشابه
Second Order Converse Duality for Nonlinear Programming
Chandra and Abha [European J. Oper. Res. 122 (2000), 161-165] considered a nonlinear programming problem over cone constraints and presented the correct forms of its four types of duals formulated by Nanda and Das [European J. Oper. Res. 88 (1996) 572-577]. Yang et al. [Indian J. Pure Appl. Math. 35 (2004), 699-708] considered the same problem and discussed weak and strong duality for its four ...
متن کاملOn second-order converse duality for a nondifferentiable programming problem
A second-order dual for a nonlinear programming problem was introduced by Mangasarian ([1]). Later, Mond [2] proved duality theorems under a condition which is called “second-order convexity”. This condition is much simpler than that used by Mangasarian. Later, Mond and Weir [3] reformulated the second-order dual. In [4], Mond considered the class of nondifferentiable mathematical programming p...
متن کاملDuality in nonlinear programming
In this paper are defined new firstand second-order duals of the nonlinear programming problem with inequality constraints. We introduce a notion of a WD-invex problem. We prove weak, strong, converse, strict converse duality, and other theorems under the hypothesis that the problem is WD-invex. We obtain that a problem with inequality constraints is WD-invex if and only if weak duality holds b...
متن کاملExtended duality for nonlinear programming
Duality is an important notion for nonlinear programming (NLP). It provides a theoretical foundation for many optimization algorithms. Duality can be used to directly solve NLPs as well as to derive lower bounds of the solution quality which have wide use in other high-level search techniques such as branch and bound. However, the conventional duality theory has the fundamental limit that it le...
متن کاملHigher-order Duality for a Nondifferentialble Programming Problem. A Converse Duality Theorem
Relative to a general class of nondifferentiable mathematical programming problems we consider a converse duality result with respect to a higher order Mond-Weir dual. AMS Mathematics Subject Classification: 90C29, 90C30, 90C32.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1975
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700024667